Constructing Searchable P2P Network with Randomly Selected Long-Distance Connections
نویسندگان
چکیده
Object lookup is a basic problem in P2P network. Long-distance connections have been used to construct a searchable P2P network according to the small-world paradigm. Long-distance connections based on distance can achieve a searchable P2P network in theorem. However, it is hard to measure the lattice distance between two peers in real P2P network. On the other hand, it is easy to construct randomly selected long-distance connections with low overhead. We increase the number of randomly selected long-distance connections k to improve the performance of object lookup. Simulation results show there is some relation among k, the network size N and the average path length. The lower bound of k to achieve a searchable P2P network is still an open question.
منابع مشابه
Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low average hop distance between any two randomly chosen nodes, and (2) a high clustering coefficient. A network with a low average hop distance implies small latency for object lookup. A network with a high clustering co...
متن کاملNavigation in Social Networks: Inspired by Kleinberg’s Model and Human Travel Behavior Research
Though the phenomenon of ’six degrees of separation’ always attracts many scientists’ attention, yet we haven’t thoroughly understood why our social network has such highly efficient decentralized search ability. Inspired by Kleinberg’s model and the fact that human travel behavior obeying power law distribution in the sense of geographical distance, we constructed a new social network model an...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملUnderstanding the effect of streaming overlay construction on AS level traffic
In this paper, we examine the effect of overlay structure in live peer-to-peer (P2P) streaming applications, on the inter-AS traffic. We identify a collection of edge ASes whose clients are likely to participate in P2P streaming applications. We derive the AS-level path between all pairs of selected edge ASes by simulating BGP routing over a snapshot of ASlevel topology. We consider three diffe...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کامل